From truth to computability II
نویسندگان
چکیده
منابع مشابه
From truth to computability II
Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and “truth” is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logical operators standing for operations on such games. Within the ambitious pr...
متن کاملFrom truth to computability I
The recently initiated approach called computability logic is a formal theory of interactive computation. It understands computational problems as games played by a machine against the environment, and uses logical formalism to describe valid principles of computability, with formulas representing computational problems and logical operators standing for operations on computational problems. Th...
متن کاملFrom Computability to Simulability
We are intelligent, so we are conscient. We are in evolution, so we construct. We are not alone, so we have to contribute. Simulation relates function to structure: faith = (intuition, inspiration, imagination) and intelligence = (adaptability, consciousness, intention) are complementary one to another. Intelligence and Faith can converge together to integration, or can destroy each other if no...
متن کاملContinuous Truth II: Reflections
In the late 1960s, Dana Scott first showed how the Stone Tarski topological interpretation of Heyting’s calculus could be extended to model intuitionistic analysis; in particular Brouwer’s continuity principle. In the early ’80s we and others outlined a general treatment of non-constructive objects, using sheaf models—constructions from topos theory—to model not only Brouwer’s non-classical con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.01.004